Question 1
Question 2
Question 4
Question 5
1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
Question 6
Question 8
α : Given G(V, E), does G have an independent set of size | V | - 4? β : Given G(V, E), does G have an independent set of size 5?Which one of the following is TRUE?
Question 9
Question 10
There are 20 questions to complete.